Combinatorial cost sharing
نویسندگان
چکیده
منابع مشابه
New techniques for cost sharing in combinatorial optimization games
Combinatorial optimization games form an important subclass of cooperative games. In recent years, increased attention has been given to the issue of finding good cost shares for such games. In this paper, we define a very general class of games, called integer minimization games, which includes the combinatorial optimization games in the literature as special cases. We then present new techniq...
متن کاملCost Sharing
The objective of cooperative game theory is to study ways to enforce and sustain cooperation among agents willing to cooperate. A central question in this field is how the benefits (or costs) of a joint effort can be divided among participants, taking into account individual and group incentives, as well as various fairness properties. In this chapter, we define basic concepts and review some o...
متن کاملThe combinatorial cost
We study the combinatorial analogues of the classical invariants of measurable equivalence relations. We introduce the notion of cost and β -invariants (the analogue of the first L -Betti number introduced by Gaboriau [3]) for sequences of finite graphs with uniformly bounded vertex degrees and examine the relation of these invariants and the rank gradient resp. mod p homology gradient invarian...
متن کاملSimple Cost-Sharing Contracts
Economic guidance can be of substantial value to policymakers in principle. However, guidance delivered in the form of complex formulae and detailed mathematical characterizations of optimal policies may not be fully appreciated or warmly embraced. Consequently, insights like those of William Rogerson (2003) are particularly important. Rogerson demonstrates in a plausible setting that a pair of...
متن کاملStatistical Cost Sharing
We study the cost sharing problem for cooperative games in situations where the cost function C is not available via oracle queries, but must instead be learned from samples drawn from a distribution, represented as tuples (S,C(S)), for different subsets S of players. We formalize this approach, which we call STATISTICAL COST SHARING, and consider the computation of the core and the Shapley val...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGecom Exchanges
سال: 2019
ISSN: 1551-9031
DOI: 10.1145/3331041.3331046